Heuristic for Simulation Checking
نویسنده
چکیده
Equivalence checking is a common problem in formal software design. It is the process of determining whether two systems are equivalent to each other according to some mathematically defined notion of equivalence. In this paper to improve efficiency we present a procedure, based on heuristic searches, for checking the well-know simulation relation defined by Milner. We use heuristic mechanisms for the exploration of the search space, in order to avoid the construction of the complete state graph.
منابع مشابه
A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملModel Checking Safety Properties through Simulation and Heuristic Search
This paper presents an efficient procedure to perform model checking of a concurrent process against a temporal logic formula, through the checking of a simulation between the description of the system and of the formula in the same formalism. The approach is applied, as an example, to processes defined through a specification language very compact, the well-know Calculus of Communicating Syste...
متن کاملChoice of Tests for Logic Veri cation and Equivalence Checking and the Use of Fault Simulation
A new method is proposed for checking the equivalence of two irredundant logic implementations of a combina tional Boolean function The procedure consists of gen eration of complete checkpoint fault test sets for both cir cuits The two test sets are concatenated and both cir cuits are simulated to obtain the response to the combined test set If the responses of the two circuits match for all ve...
متن کاملEfficient Model Checking by Automated Ordering of Transition Relation Partitions
In symbolic model checking, the behavior of a model to be verified is captured by the transition relation of the state space implied by the model. Unfortunately, the size of the transition relation grows rapidly with the number of states even for small models, rendering them impossible to verify. A recent work [5] described a method for partitioning the transition relation, thus reducing the ov...
متن کاملEquivalence Checking in C-based System-level Design by Sequentializing Concurrent Behaviors
In system-level designs, since many incremental refinements are applied to the designs, equivalence checking between each refinement should be applied. However, proving whether two concurrent designs are equivalent is a difficult task, not to mention that the concurrent design itself can be error-prone. In this paper, we propose an equivalence checking method for C-based descriptions of systeml...
متن کامل